On analytically equivalent ideals
نویسندگان
چکیده
منابع مشابه
Analytically solvable processes on networks
We introduce a broad class of analytically solvable processes on networks. In the special case, they reduce to random walk and consensus process, the two most basic processes on networks. Our class differs from previous models of interactions (such as the stochastic Ising model, cellular automata, infinite particle systems, and the voter model) in several ways, the two most important being (i) ...
متن کاملOn ideals of ideals in $C(X)$
In this article, we have characterized ideals in $C(X)$ in which every ideal is also an ideal (a $z$-ideal) of $C(X)$. Motivated by this characterization, we observe that $C_infty(X)$ is a regular ring if and only if every open locally compact $sigma$-compact subset of $X$ is finite. Concerning prime ideals, it is shown that the sum of every two prime (semiprime) ideals of e...
متن کاملLearning Analytically and Inductively
Learning is a fundamental component of intelligence, and a key consideration in designing cognitive architectures such as Soar [Laird et al., 1986]. This chapter considers the question of what constitutes an appropriate general-purpose learning mechanism. We are interested in mechanisms that might explain and reproduce the rich variety of learning capabilities of humans, ranging from learning p...
متن کاملon the equivalence of constructed-response and multiple-choice : stem-equivalent, stem non-equivalent but content equivalent, and stem and content non-equivalent items in reading comprehension using multifaceted rasch
the present study investigated construct equivalence of multiple choice (mc) and constructed response (cr) item types across stem and content equivalent mc and cr items (item type ‘a’), non-stem-equivalent but content equivalent mc and cr items (item type ‘b’), and non-stem and non-content equivalent mc and cr items (item type ‘c’). one hundred seventy english-major undergraduates completed mc ...
Evaluating Search Methods Analytically
A unified approach to analyzing search algorithms is presented. Each algorithm is characterized by the types of random problems that it can solve rapidly. The results are displayed in a way that clearly indicabes the strengths and weaknesses of each algorithm. Many interesting problems can, at present, best be solved by search methods [7]. In the worst case, searching requires exponent ial time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications mathématiques de l'IHÉS
سال: 1969
ISSN: 0073-8301,1618-1913
DOI: 10.1007/bf02684598